Effort comparisons for a class of four-player tournaments

Optimal effort incentives in dynamic tournaments

This paper analyzes two-stage rank-order tournaments. A principal decides (i) how to spread prize money across the two periods, (ii) how to weigh performance in the two periods when awarding the second-period prize, and (iii) whether to reveal performance after the first period. The information revelation policy depends exclusively on properties of the effort cost function. The principal always...

A class of tight circulant tournaments

A tournament is said to be tight whenever every 3-colouring of its vertices using the 3 colours, leaves at least one cyclic triangle all whose vertices have different colours. In this paper, we extend the class of known tight circulant tournaments.

Optimal Effort Incentives in Dynamic Tournaments

Confidence Intervals for Computational Effort Comparisons

When researchers make alterations to the genetic programming algorithm they almost invariably wish to measure the change in performance of the evolutionary system. No one specific measure is standard, but Koza’s computational effort statistic is frequently used [8]. In this paper the use of Koza’s statistic is discussed and a study is made of three methods that produce confidence intervals for ...

A paired comparisons ranking and Swiss-system chess team tournaments

The paper reveals that the Weighted Logarithmic Least Squares Method used for deriving evaluations of alternatives from incomplete pairwise comparison matrices (iWLLSM) coincides with the recursive Buchholz ranking method applied in generalized tournaments, despite their different approach and calculation. We study it with respect to a set of new properties and present the strength of the metho...